A Novel Representation to Improve Team Problem Solving in Real-Time

This paper proposes a novel representation to support computing metrics that help understanding and improving in real-time a team's behavior during problem solving in real-life. Even though teams are important in modern activities, there is little computing aid to improve their activity. The representation captures the different mental images developed, enhanced, and utilized during solving. A case study illustrates the representation.Comment: 6 pages, 6 figures. arXiv admin note: text overlap with arXiv:2308.0627

A Novel Model for Capturing the Multiple Representations during Team Problem Solving based on Verbal Discussions

Improving the effectiveness of problem solving in teams is an important research topic due to the complexity and cross-disciplinary nature of modern problems. It is unlikely that an individual can successfully tackle alone such problems. Increasing team effectiveness is challenging due to the many entangled cognitive, motivational, social, and emotional aspects specific to teamwork. It is often difficult to reliably identify the characteristics that make a team efficient or those that are main hurdles in teamwork. Moreover, experiments often produced conflicting results, which suggests possibly incorrect modeling of team activities and/or hypothesis formulation errors. Automated data acquisition followed by analytics based on models for teamwork is a intriguing option to alleviate some of the limitations. This paper proposes a model describing an individual's activities during team problem solving. Verbal discussions between team members are used to build models. The model captures the multiple images (representations) created and used by an individual during solving as well as the solving activities utilizing these images. Then, a team model includes the interacting models of the members. Case studies showed that the model can highlight differences between teams depending on the nature of the individual work before teamwork starts. Inefficiencies in teamwork can be also pointed out using the model.Comment: 24 pages, 7 figure

Scheduling with Bus Access Optimization for Distributed Embedded Systems

In this paper, we concentrate on aspects related to the synthesis of distributed embedded systems consisting of programmable processors and application-specific hardware components. The approach is based on an abstract graph representation that captures, at process level, both dataflow and the flow of control. Our goal is to derive a worst case delay by which the system completes execution, such that this delay is as small as possible; to generate a logically and temporally deterministic schedule; and to optimize parameters of the communication protocol such that this delay is guaranteed. We have further investigated the impact of particular communication infrastructures and protocols on the overall performance and, specially, how the requirements of such an infrastructure have to be considered for process and communication scheduling. Not only do particularities of the underlying architecture have to be considered during scheduling but also the parameters of the communication protocol should be adapted to fit the particular embedded application. The optimization algorithm, which implies both process scheduling and optimization of the parameters related to the communication protocol, generates an efficient bus access scheme as well as the schedule tables for activation of processes and communications

Scheduling of Conditional Process Graphs for the Synthesis of Embedded Systems

We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of several processors, ASICs and shared busses. We have developed a heuristic which generates a schedule table so that the worst case delay is minimized. Several experiments demonstrate the efficiency of the approach. 1